Flexible Matching of Boolean Symbolic Objects
نویسندگان
چکیده
Matching is the process of comparing two or more structures to discover their likenesses or differences. It is a common operation performed in symbolic classification, pattern recognition, data mining and expert systems. The definition of a matching operator for Boolean symbolic objects is important for the development of symbolic data analysis techniques. In this paper we give the definition of canonical matching of Boolean symbolic objects, and then we extend it in order to take into account only partial matching caused by the presence of noise. The new definition of flexible matching is based on the probability theory. Some experimental results are reported.
منابع مشابه
Improved Skips for Faster Postings List Intersection
Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...
متن کاملImproved Skips for Faster Postings List Intersection
Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...
متن کاملA Novel Symbolic Algorithm for Maximum Weighted Matching in Bipartite Graphs
The maximum weighted matching problem in bipartite graphs is one of the classic combinatorial optimization problems, and arises in many different applications. Ordered binary decision diagram (OBDD) or algebraic decision diagram (ADD) or variants thereof provides canonical forms to represent and manipulate Boolean functions and pseudo-Boolean functions efficiently. ADD and OBDD-based symbolic a...
متن کاملGeneralized Matching: a new approach to concurrent logic optimization and library binding
In this work we describe a novel approach to the classical problem of library binding. We de ne the concept of generalized matching, a Boolean constraint whose satisfaction allows us to nd all possible input assignments for which a library element matches a given Boolean relation. Completely and incompletely speci ed Boolean functions are treated as particular cases. Generalized matching suppor...
متن کاملMatching of Polygon Objects by Optimizing Geometric Criteria
Despite the semantic criteria, geometric criteria have different performances on polygon feature matching in different vector datasets. By using these criteria for measuring the similarity of two polygons in all matchings, the same results would not have been obtained. To achieve the best matching results, the determination of optimal geometric criteria for each dataset is considered necessary....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998